By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 23, Issue 6, pp. 1093-1347

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

A Grammar-Based Approach Towards Unifying Hierarchical Data Models

Marc Gyssens, Jan Paredaens, and Dirk Van Gucht

pp. 1093-1137

BibTeX  Abstract Full Text:  PDF

Selecting Heavily Covered Points

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John E. Hershberger, Raimund Seidel, and Micha Sharir

pp. 1138-1151

BibTeX  Abstract Full Text:  PDF

Distributed Algorithms For Unidirectional Networks

Yehuda Afek and Eli Gafni

pp. 1152-1178

BibTeX  Abstract Full Text:  PDF

Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality

Dorit S. Hochbaum and Joseph (Seffi) Naor

pp. 1179-1192

BibTeX  Abstract Full Text:  PDF

Computing the Order of a Locally Testable Automaton

Sam M. Kim and Robert McNaughton

pp. 1193-1215

BibTeX  Abstract Full Text:  PDF

A Polynomial-Time Algorithm For the Perfect Phylogeny Problem When the Number of Character States is Fixed

Richa Agarwala and David Fernández-Baca

pp. 1216-1224

BibTeX  Abstract Full Text:  PDF

Priority Queues and Permutations

M. D. Atkinson and Robert Beals

pp. 1225-1230

BibTeX  Abstract Full Text:  PDF

A Model for Asynchronous Shared Memory Parallel Computation

Naomi Nishimura

pp. 1231-1252

BibTeX  Abstract Full Text:  PDF

Tight Bounds on Oblivious Chaining

Shiva Chaudhuri

pp. 1253-1265

BibTeX  Abstract Full Text:  PDF

Requirements for Deadlock-Free, Adaptive Packet Routing

Robert Cypher and Luis Gravano

pp. 1266-1274

BibTeX  Abstract Full Text:  PDF

On Languages Reducible to Algorithmically Random Languages

Ronald V. Book

pp. 1275-1282

BibTeX  Abstract Full Text:  PDF

A Fast Algorithm For Optimum Height-Limited Alphabetic Binary Trees

Lawrence L. Larmore and Teresa M. Przytycka

pp. 1283-1312

BibTeX  Abstract Full Text:  PDF

Improved Algorithms For Linear Inequalities with Two Variables Per Inequality

Edith Cohen and Nimrod Megiddo

pp. 1313-1347

BibTeX  Abstract Full Text:  PDF